Coded Demixing for Unsourced Random Access

Unsourced random access (URA) is a recently proposed multiple paradigm tailored to the uplink channel of machine-type communication networks. By exploiting strong connection between URA and compressed sensing, massive problem may be cast as sensing (CS) problem, albeit one in exceedingly large dimensions. To efficiently handle dimensionality coded (CCS) has emerged pragmatic signal processing tool that, when applied URA, offers good performance at low complexity. While CCS effective recovering that sparse with respect single basis, it unable jointly recover signals are separate bases. In this article, framework extended demixing setting, yielding novel technique called demixing. A generalized for presented low-complexity recovery algorithm based on approximate message passing (AMP) developed. Coded heterogeneous multi-class networks traditional single-class Its analyzed numerical simulations highlight benefits